An Algorithm for the Nucleolus of Airport Profit Problems
نویسندگان
چکیده
Airport profit games are a generalization of airport cost games as well as of bankruptcy games. In this paper we present a simple algorithm to compute the nucleolus of airport profit games. In addition we prove that there exists an unique consistent allocation rule in airport profit problems, and it coincides with the nucleolus of the associated TU game. ∗We acknowledge the advice from Peter Sudhölter in shortening some proofs. This work has been financed by project 1/UPV 00031.321-HA-7903/2000 and DGES Ministerio de Educación y Ciencia (project BEC2000-0875).
منابع مشابه
A Bi-Objective Airport Gate Scheduling with Controllable Processing Times Using Harmony Search and NSGA-II Algorithms
Optimizing gate scheduling at airports is an old, but also a broad problem. The main purpose of this problem is to find an assignment for the flights arriving at and departing from an airport, while satisfying a set of constraints.A closer look at the literature in this research line shows thatin almost all studies airport gate processing time has been considered as a fix parameter. In this res...
متن کاملProfit intensity criterion for transportation problems
In this study criterion of maximum profit intensity for transportation problems, in contrast to the known criteria of minimum expenses or minimum time for transportation, is considered. This criterion synthesizes financial and time factors and has real economic sense. According to the purpose of this paper, the algorithm of the solution of such a transportation problem is constructed. It is sho...
متن کاملAn alternative characterization of the nucleolus in airport problems
We consider a class of cost sharing problems with the following features: agents are ordered in terms of their needs for a public facility, and satisfying a given agent implies satisfying all agents with smaller needs than his. We show that the nucleolus is the only rule satisfying equal treatment of equals, last-agent cost additivity, and last-agent consistency. This characterization reveals t...
متن کاملOn the nucleolus of neighbor games
Assignment problems are well-known problems in practice. We mention house markets, job markets, and production planning. The games of interest in this paper, the neighbor games, arise from a special class of assignment problems. We focus on the nucleolus [D. Schmeidler, SIAM J. Appl. Math. 17 (1969) 1163–1170], one of the most prominent core solutions. A core solution is interesting with respec...
متن کاملAn Optimum Model for the Design of Airport Aprons
In the process of the optimum design of aprons, solutions should be found for problems and such issues as the optimum area and dimensions of the apron, including the passenger and the cargo the number and dimensions of the gates on the basis of different types of aircraft parking configuration aircraft simulation and arrangement in different time periods of the given day at the airport. In this...
متن کامل